Towards a Common Framework for Dialectical Proof Procedures in Abstract Argumentation
نویسندگان
چکیده
We present a common framework for dialectical proof procedures for computing credulous, grounded, ideal and sceptical preferred semantics of abstract argumentation. The framework is based on the notions of dispute derivation and base derivation. Dispute derivation is a dialectical notion first introduced for computing credulous semantics in assumption-based argumentation, and adapted here for computing credulous semantics and grounded semantics. Base derivation is introduced for two purposes: (i) to characterize all preferred extensions containing a given argument, and (ii) to represent backtracking in the search for a dispute derivation. We prove the soundness of the proof procedures for any argumentation frameworks and their completeness for general classes of finitary or finite-branching argumentation frameworks containing the class of finite argumentation frameworks as a subclass. We also discuss related results.
منابع مشابه
A Unified Framework for Representation and Development of Dialectical Proof Procedures in Argumentation
We present an unified methodology for representation and development of dialectical proof procedures in abstract argumentation based on the notions of legal environments and dispute derivations. A legal environment specifies the legal moves of the dispute parties while a dispute derivation describes the procedure structure. A key insight of this paper is that the opponent moves determine the so...
متن کاملA Lattice-Based Approach to Computing Warranted Beliefs in Skeptical Argumentation Frameworks
Abstract argumentation frameworks have played a major role as a way of understanding argumentbased inference, resulting in different argumentbased semantics. In order to make such semantics computationally attractive, suitable proof procedures are required, in which a search space of arguments is examined to find out which arguments are warranted or ultimately acceptable. This paper introduces ...
متن کاملAn Abstract Model for Computing Warrant in Skeptical Argumentation Frameworks
Abstract argumentation frameworks have played a major role as a way of understanding argument-based inference, resulting in different argument-based semantics. The goal of such semantics is to characterize which are the rationally justified (or warranted) beliefs associated with a given argumentative theory. In order to make such semantics computationally attractive, suitable argument-based pro...
متن کاملDialectical Abstract Argumentation: A Characterization of the Marking Criterion
This article falls within the field of abstract argumentation frameworks. In particular, we focus on the study of frameworks using a proof procedure based on dialectical trees. These trees rely on a marking procedure to determine the warrant status of their root argument. Thus, our objective is to formulate rationality postulates to characterize the marking criterion over dialectical trees. The...
متن کاملArgument - based Approaches to Discussion , Inference and Uncertainty
Formal argumentation has become a popular approach for nonmonotonic reasoning and multi-agent communication in Artificial Intelligence and Computer Science. The approach of Dung on the semantics of abstract argumentation frameworks, which specifies different criteria for selecting arguments given an argumentation framework, received a lot of followup. This work aims to enhance today’s generatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 19 شماره
صفحات -
تاریخ انتشار 2009